Lu Factorization on Parallel Computers
نویسنده
چکیده
Abstract-A new parallel algorithm for the LU factorization of a given dense matrix A is described. The case of banded matrices is also considered. This algorithm can be combined with Sameh and Brent’s [SIAM J. Numer. Anal. 14, 1101-I 113. (1977)] to obtain the solution of a linear system of algebraic equations. The arithmetic complexity for the dense case is in’ ($bn in the banded case), using 3(n 1) processors and no square roots.
منابع مشابه
Parallel Solution of a Traffic Flow Simulation Problem
Computational Fluid Dynamics (CID) methods for solving traffic flow continuum models have been studied and efficiently implemented in traffic simulation codes in the past. This is the first time that such methods are studied from the point of view of parallel computing. We studied and implemented an implicit numerical method for solving the high-order flow conservation traffic model on parallel...
متن کاملParallel Multilevel Block ILU Preconditioning Techniques for Large Sparse Linear Systems
We present a class of parallel preconditioning strategies built on a multilevel block incomplete LU (ILU) factorization technique to solve large sparse linear systems on distributed memory parallel computers. The preconditioners are constructed by using the concept of block independent sets. Two algorithms for constructing block independent sets of a distributed sparse matrix are proposed. We c...
متن کاملLoad Balancing Problem for Parallel Computers with Distributed Memory
This paper deals with load balancing of parallel algorithms for distributedmemory computers. The parallel versions of BLAS subroutines for matrix-vector product and LU factorization are considered. Two task partitioning algorithms are investigated and speed-ups are calculated. The cases of homogeneous and heterogeneous collections of computers/processors are studied, and special partitioning al...
متن کاملScalable Parallel Sparse Factorization with Left-right Looking Strategy on Shared Memory Multiprocessors 1 Scalable Parallel Sparse Factorization with Left-right Looking Strategy on Shared Memory Multiprocessors
An eecient sparse LU factorization algorithm on popular shared memory mul-tiprocessors is presented. Interprocess communication is critically important on these architectures-the algorithm introduces O(n) synchronization events only. No global barrier is used and a completely asynchronous scheduling scheme is one central point of the implementation. The algorithm aims at optimizing the single n...
متن کاملOptimal Grain Size Computation for
In this paper, we present a method for overlapping communications on parallel computers for pipelined algorithms. We rst introduce a general theoretical model which leads to a generic computation scheme for the optimal packet size. Then, we use the OPIUM 3 library, which provides an easy-to-use and eecient way to compute, in the general case, this optimal packet size, on the column LU factoriza...
متن کامل